Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
891	ECRYPT II   ICT[removed]ECRYPT II European Network of Excellence in Cryptology II Add to Reading List Source URL: www.ecrypt.eu.org Language: English - Date: 2010-05-04 11:48:24 Finite fields Cryptographic protocols Diffie–Hellman problem Hellman XTR CDH Diffie–Hellman key exchange Whitfield Diffie Discrete logarithm Cryptography Abstract algebra Computational hardness assumptions
892	Computational Creativity: The Final Frontier? Simon Colton1 and Geraint A. Wiggins2 Abstract. Notions relating to computational systems exhibiting creative behaviours have been explored since the very early days of compu Add to Reading List Source URL: computationalcreativity.net Language: English - Date: 2013-11-11 07:24:16 Creativity Mind Science Neuroscience Strong AI A New Kind of Science Skill Computer music Aesthetics Artificial intelligence Problem solving Computational creativity
893	ECRYPT II   ICT[removed]ECRYPT II European Network of Excellence in Cryptology II Add to Reading List Source URL: www.ecrypt.eu.org Language: English - Date: 2013-03-26 12:35:28 Finite fields Cryptographic protocols Diffie–Hellman problem Trapdoor function Hellman XTR CDH Diffie–Hellman key exchange Discrete logarithm Cryptography Abstract algebra Computational hardness assumptions
894	Chapter 2: Greedy Algorithms and Local Search (cp. Williamson & Shmoys, Chapter 2) 16 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 NP-complete problems Operations research Mathematical optimization Complexity classes Travelling salesman problem Job shop scheduling Dominating set Greedy algorithm Algorithm Theoretical computer science Computational complexity theory Applied mathematics
895	The Power of Recourse for Online MST and TSP Nicole Megow1 , Martin Skutella1? , Jos´e Verschae2?? , and Andreas Wiese3? ? ? 1 3 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 03:19:45 Analysis of algorithms Operations research Spanning tree Online algorithms Minimum spanning tree Amortized analysis Travelling salesman problem Competitive analysis Randomized algorithm Theoretical computer science Computational complexity theory Mathematics
896	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
897	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 13:17:57 NP-complete problems Probabilistic complexity theory Mathematical optimization Complexity classes PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics
898	Chapter 9: The Hardness of Approximation (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-02-14 09:39:33 Computational complexity theory NP-complete problems Probabilistic complexity theory PCP theorem Approximation algorithm Clique problem Probabilistically checkable proof NP Clique Theoretical computer science Applied mathematics Mathematics
899	Chapter 5: Random Sampling and Randomized Rounding of Linear Programs (cp. Williamson & Shmoys, Chapter 5) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:15:06 NP-complete problems Combinatorial optimization Analysis of algorithms Logic in computer science Time complexity Boolean satisfiability problem Randomized algorithm Algorithm Maximum satisfiability problem Theoretical computer science Applied mathematics Computational complexity theory
900	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:04 Approximation algorithm Computational complexity theory Bin packing problem Summation Theoretical computer science Mathematics Applied mathematics

UPDATE